|
|
6.2 | Dynamic Routing Overview | ||
| 6.2.5 | Distance vector routing protocol features |
|
Distance vector routing algorithms pass
periodic copies of a routing table from router to router. These
regular updates between routers communicate topology changes. Distance
vector based routing algorithms are also known as Bellman-Ford
algorithms. Each router receives a routing table
from its directly connected neighbor routers.
The algorithm eventually accumulates network distances so that it can maintain a database of network topology information. However, distance vector algorithms do not allow a router to know the exact topology of an internetwork as each router only sees its neighbor routers. Each router that uses distance vector
routing begins by identifying its own neighbors.
Routing table updates occur when the
topology changes. As with the network discovery process, topology
change updates proceed step-by-step from router to router.
An analogy of distance vector could be the signs found at a highway intersection. A sign points towards a destination and indicates the distance to the destination. Further down the highway, another sign points toward the destination, but now the distance is shorter. As long as the distance is shorter, the traffic is following the best path.
|